Satis ability Modulo Structures as Constraint Satisfaction: An Introduction
نویسندگان
چکیده
Constraint Programming (CP) and Satis ability Modulo Theories (SMT) both generalize SAT w.r.t. expressiveness and propagation power. CP uses domain propagators based on mathematical structures, whereas SMT uses constraint propagators based on logical theories. In this paper, we incorporate SMT reasoning into CP and illustrate the bene ts of the resulting system for the problem of rule veri cation.
منابع مشابه
Heuristic Backbone Sampling for Maximum Satis ability
The weighted maximum satis ability (MAXSAT) problem is of great interest to the Arti cial Intelligence community, as a model for several constraint satisfaction problems (emerging e.g. from planning) which require that an optimum subset of their constraints be satis ed. Recent research on satis ability (SAT) problems has reached interesting conclusions regarding their hardness. In this paper, w...
متن کاملExploiting a Theory of Phase Transitions in Three-Satisfiability Problems
In the past few years there have been several empirical discoveries of phase transitions in constraint satisfaction problems (CSPs), and a growth of interest in the area among the arti cial intelligence community. This paper extends a simple analytical theory of phase transitions in three-satis ability (3-SAT) problems in two directions. First, a more accurate, problem-dependent calculation lea...
متن کاملDefault Reasoning Using Classical Logic
In this paper we show how propositional default theories can be characterized by classical propositional theories: for each nite default theory, we show a classical propositional theory such that there is a one-to-one correspondence between models for the latter and extensions of the former. This means that computing extensions and answering queries about coherence, set-membership and set-entai...
متن کاملHow Not To Do
We give some dos and don'ts for those analysing algorithms experimentally. We illustrate these with many examples from our own research on the study of algorithms for NP-complete problems such as satis ability and constraint satisfaction. Where we have not followed these maxims, we have su ered as a result.
متن کاملThe complexity of general-valued CSPs seen from the other side
General-valued constraint satisfaction problems (VCSPs) are generalisations of CSPs dealing with homomorphisms between two valued structures. We study the complexity of structural restrictions for VCSPs, that is, restrictions defined by classes of admissible lefthand side valued structures. As our main result, we show that for VCSPs of bounded arity the only tractable structural restrictions ar...
متن کامل